Extraction Security of Sequential Aggregate Signatures

نویسندگان

چکیده

Aggregate signature schemes enable anyone to compress many signatures into one. Besides the unforgeability of aggregate signature, another property called extraction sometimes is useful. In sequential schemes, computed incrementally by signers. We introduce security in context which can be seen as an analogy introduced Boneh et al. CRYPTO 2003. addition practical meaning, it also has benefits construction hierarchical identity-based we will point out. study several well known and prove some them satisfy security.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ID-Based Sequential Aggregate Signatures

An aggregate signature provides a method for combining n signatures of n different messages from n different signers into one signature of unit length. The main benefit of such schemes is that they allow bandwidth and computational savings. There exist several trials for the construction of ID-based aggregate signature schemes so far. Unfortunately, the computational complexity and (or) signatu...

متن کامل

Sequential Aggregate Signatures Made Shorter

Sequential aggregate signature (SAS) is a special type of public-key signature that allows a signer to add his signature into a previous aggregate signature in sequential order. In this case, since many public keys are used and many signatures are employed and compressed, it is important to reduce the sizes of signatures and public keys. Recently, Lee, Lee, and Yung (PKC 2013) proposed an effic...

متن کامل

History-Free Sequential Aggregate Signatures

Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion of unforgeability is preserved. Recently, Eikemeier et al. (SCN 2010) considered the notion of history-free sequential aggregation for message authentication codes, where the sequentiallyexecuted aggregation algorithm ...

متن کامل

Sequential Aggregate Signatures with Lazy Verification

Sequential aggregate signature schemes allow n signers, in order, to sign a message each, at a lower total cost than the cost of n individual signatures. We present a sequential aggregate signature scheme based on trapdoor permutations (e.g., RSA). Unlike prior such proposals, our scheme does not require a signer to retrieve the keys of other signers and verify the aggregateso-far before adding...

متن کامل

Sequential Aggregate Signatures from Trapdoor Permutations

An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham) is a method for combining n signatures from n different signers on n different messages into one signature of unit length. We propose sequential aggregate signatures, in which the set of signers is ordered. The aggregate signature is computed by having each signer, in turn, add his signature to it. We show how...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chinese Journal of Electronics

سال: 2021

ISSN: ['1022-4653', '2075-5597']

DOI: https://doi.org/10.1049/cje.2021.06.011